Exact Solution of the Six-Vertex Model on a Random Lattice

نویسنده

  • Ivan K. Kostov
چکیده

We solve exactly the 6-vertex model on a dynamical random lattice, using its representation as a large N matrix model. The model describes a gas of dense nonintersecting oriented loops coupled to the local curvature defects on the lattice. The model can be mapped to the c = 1 string theory, compactified at some length depending on the vertex coupling. We give explicit expression for the disk amplitude and evaluate the fractal dimension of its boundary, the average number of loops and the dimensions of the vortex operators, which vary continuously with the vertex coupling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magnetic Properties in a Spin-1 Random Transverse Ising Model on Square Lattice

In this paper we investigate the effect of a random transverse field, distributed according to a trimodal distribution, on the phase diagram and magnetic properties of a two-dimensional lattice (square with z=4),  ferromagnetic Ising system consisting of magnetic atoms with spin-1. This study is done using the effectivefield theory (EFT) with correlations method. The equations are derived using...

متن کامل

Symmetric Vertex Models on Planar Random Graphs

We discuss a 4-vertex model on an ensemble of 3-valent (Φ) planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The regular lattice equivalent of the model is the symmetric 8-vertex model on the honeycomb lattice, which can be mapped on to an Ising model in field, as was originally shown by Wu et.al. using generalised weak graph transformation technique...

متن کامل

Exact Solution of the Three-color Problem on a Random Lattice

We present the exact solution of the Baxter's three-color problem on a random planar graph, using the random-matrix formulation of the problem, given by B. Eynard and C. Kristjansen. We find that the number of three-coloring of an infinite random graph is 0.9843 per vertex.

متن کامل

Exactly solvable interacting spin-ice vertex model.

A special family of solvable five-vertex model is introduced on a square lattice. In addition to the usual nearest-neighbor interactions, the vertices defining the model also interact along one of the diagonals of the lattice. This family of models includes in a special limit the standard six-vertex model. The exact solution of these models is an application of the matrix product ansatz introdu...

متن کامل

The six-vertex model on random lattices

In this letter, the 6-vertex model on dynamical random lattices is defined via a matrix model and rewritten (following I. Kostov) as a deformation of the O(2) model. In the large N planar limit, an exact solution is found at criticality. The critical exponents of the model are determined; they vary continously along the critical line. The vicinity of the latter is explored, which confirms that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008